Tabu Search for a Discrete Lot Sizing and Scheduling Problem
نویسندگان
چکیده
In this paper we consider a multi-item, multi-machine discrete lot sizing and scheduling problems (DLSP) which consists of finding a minimal cost production schedule over a finite discrete horizon, where in each period a machine may be either producing one item at full capacity or is idle. The demand for each item in each period is known, and can be satisfied either by production in the period, or from stock carried from the previous periods.
منابع مشابه
A New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملA genetic algorithm for multi-level, multi-machine lot sizing and scheduling
This contribution introduces a mixed{integer programming formulation for the multi{level, multi{machine proportional lot sizing and scheduling problem. It also presents a genetic algorithm to solve that problem. The e ciency of that algorithm is due to an encoding of solutions which uses a two{dimensional matrix representation with non{binary entries rather than a simple bitstring. A computatio...
متن کاملSimultaneous Lot Sizing and Scheduling in a Flexible Flow Line
This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...
متن کاملA Parallel Tabu Search Algorithm for Short-term Lot Sizing and Scheduling in Flexible Flow Line Environments1
In this paper, the problem of short-term production planning in flexible flow lines is considered. A MIP model formulation of the proportional lot sizing problem for multilevel production processes with alternatively usable machines is presented. This model is very general in terms of material routing through the system and allocation of items and machines to production stages. By definition of...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کامل